Methods And Apparatus For Radio Resource Allocation

ABSTRACT

Systems and techniques for scheduling of use of resources by wireless devices and allocation of resources among devices. Information is received relating to channel efficiency experienced by a user equipment and also to the channel efficiency experienced by other user equipments. The information may include channel gain. Scheduling and resource allocation are performed so as to provide service to each device while minimizing interference penalties imposed by devices on one another. Scheduling and resource allocation may be evaluated and conducted through a number of mechanisms, such as ranking users according to transmit power, ranking user equipments according to target signal to noise ratios, and evaluation of relative advantages to users with the evaluation being performed resource block by resource block. The various metrics take into account both advantages to a particular user equipment under consideration and detrimental effects on other user equipment.

PRIORITY

This application claims priority under 35 U.S.C. 119(a) to “Methods and Apparatus for Radio Resource Allocation,” Indian Patent Application No. 2687/DEL/2011, filed on 16 Sep. 2011 and incorporated herein by reference in its entirety.

FIELD OF THE INVENTION

The present invention relates generally to wireless communication. More particularly, the invention relates to systems and techniques for managing allocation of resources to devices operating in a wireless network.

BACKGROUND

One of the greatest problems facing wireless network operators is the need to serve large numbers of customers with varying needs using the infrastructure available to them. Numerous considerations affect the number of customers that may be served by a particular set of resources, and constant efforts are being directed toward scheduling of devices and allocation of resources to devices to achieve high levels of overall efficiency.

SUMMARY OF THE INVENTION

In one embodiment of the invention, a method comprises receiving channel gain information from a user equipment. The channel gain information comprises measurements of the channel gain experienced by the user equipment to its serving and neighboring cell base stations. One or more parameters are computed for scheduling and resource allocation among the user equipment and the additional user equipments. The one or more parameters are calculated so as to take into account the measurements of channel gain experienced by the user equipment to its serving and neighboring cell base stations.

In another embodiment of the invention, a computer readable memory stores a program of instructions. When executed by a processor, the instructions cause an apparatus to perform functions comprising receiving channel gain information from a user equipment. The channel gain information comprises measurements of channel gain experienced by the user equipment to its serving and neighboring cell base stations. The functions further comprise computing one or more parameters for scheduling and resource allocation among the user equipment and the additional user equipments. The one or more metrics are calculated so as to take into account the measurements of channel gain experienced by the user equipment to its serving and neighboring cell base stations.

These and other embodiments are described below with particularity.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 illustrates a network that may be operated according to an embodiment of the present invention;

FIG. 2 illustrates devices that may operate according to an embodiment of the present invention;

FIGS. 3A-3C compares target signal to noise ratio against throughput for various exemplary scheduling and resource allocation mechanisms;

FIG. 4 illustrates the response of various properties to resource allocation;

FIG. 5 illustrates an aspect of resource allocation according to an embodiment of the present invention;

FIG. 6 illustrates a process of determining and performing scheduling and resource allocation according to an embodiment of the present invention; and

FIGS. 7 and 8 illustrate results of scheduling and resource allocation according to embodiments of the present invention.

DETAILED DESCRIPTION

Various embodiments of the present invention recognize that the quality of service provided to users is affected not only by their own interactions with network resources, but by the operations of other users and the allocation of resources to those users. It will also be recognized that allocations of the same resources to different users may provide different levels of improvement from one user as compared to another, and that the overall service provided to all users is an important consideration in resource allocation, so that an advantageous overall level of service to the entire user population can be better provided by taking into account, for the allocation to resources of each user, how such an allocation will affect other users, and by comparing the improvement provided to one user by particular resources to the improvement that might be provided to other users if they were allocated the same resources.

An important measure of service to a user is the throughput that can be achieved by a user, and an important factor in determining the throughput achieved by a user is the channel gain experienced by the user. The overall service provided by a network, therefore, is in substantial part a factor of total throughput achieved by all users and this total throughput is influenced by the channel gain experienced by all users. Therefore, embodiments of the present invention evaluate the allocation of resources to one user by taking into account not only the positive effect of the allocation on the user's channel gain, but also the negative effect of the allocation on the channel gains of other users. If the channel gain to the user's own receiver is referred to as g, the channel gain to another user's receiver may be referred to as g′. Information indicating the channel gain of another receiver may be obtained using reciprocity. The transmitting device of a transmitter-receiver pair engaging in communication measures the received signal strength from other receivers acting as transmitters. An example of this procedure would be, during the uplink of a cellular system, a measuring by a mobile device of the received signal strength from base stations in the downlink. In a frequency division duplex (FDD) system, this reciprocity allows measurement of long-term average channel gain that corresponds to distance and shadow fade based channel gain, while for a time division duplex (TDD) system, reciprocity allows measurement of the long and short term channel gain that also includes distance-based channel gain and shadow fade-based channel gain.

In various embodiments of the invention, various exemplary factors may be taken into account in making scheduling and resource allocation decisions. One such factor is the relative ranking of users based on one or more user metrics. Examples of such metrics and their computation are discussed in additional detail below. Another factor is power allocation. As part of determining power allocation, power per channel resource may be calculated. For example, power per resource block in a long-term evolution or long-term evolution advanced (LTE or LTE-A) system may employ as a factor to be taken into account the received signal to noise ratio per channel resource. In addition to taking into account the channel gain to other receivers, an analysis of the most advantageous resource allocation may take into account an interference penalty or “price” to another receiver.

A number of scheduling and resource allocation decisions may be made. Among these decisions are the determination or computation of a user metric and ranking of users for selection according to this metric. Another decision may involve power allocation, and decisions related to power allocation may include channel resource allocation and assignment, such as resource block allocation and assignment in an LTE or LTE-A system, and a target received signal to noise ratio per channel resource.

Channel resource allocation and assignment decisions may also be made. Channel resource allocation refers to the number of shared channel resources and deciding channel resource allocation may involve determining a user metric or ranking. Channel resource assignment refers to assigning specific channel resources in one or more of frequency, time, code, and space in cases such channel resources are known to have different channel gains, such as by using a sounding reference symbol (SRS) in an LTE uplink.

In general, scheduling and resource allocations depend on the quality of service (QoS) both desired by and actually realized by users, as well as traffic characteristics such as QoS class, target delay and target throughput, as well as actual delays, throughputs, queue lengths, and channel gains. Possibly, channel gains may be time, frequency, or space dependent.

Allocation of a shared channel resource to one device, and use of the shared channel resource by the device, imposes a greater or lesser penalty on other devices. This penalty may suitably be referred to as an interference penalty. Various embodiments of the present invention take the interference penalty to other users into account in allocating resources, and some embodiments use information relating to the channel gains g′ of other users' receivers in determining appropriate resource allocations and making such allocations. Various specific mechanisms for taking such information into account are described in greater detail below.

FIG. 1 illustrates a wireless network 100, comprising cells 102, 104, and 106, served by base stations 108, 110, and 112, respectively. A network controller 114 may manage the operations of, and provide services for, the base stations 108, 110, and 112, and a number of user devices, which may also be referred to as user equipments or UEs, are present in the cells 102, 104, and 106. The UEs illustrated here are UEs 116-132, and it will be recognized that the particular number and distribution of UEs illustrated here is exemplary, and that many cells can be expected to serve large numbers of UEs. It will be further recognized, however, that many cells may be relatively small, such as cells that are known as micro-cells, pico-cells, or femto-cells, and that these cells may serve only a limited number of users over a relatively small area. The teachings of the present invention may be advantageously employed in cells of any size, with particular advantages being gained for cells in which users are particularly susceptible to interference.

FIGS. 2A-2C illustrate additional details of the exemplary base station 108, network controller 114, and UE 116, respectively. It will be recognized that the particular configurations shown here are exemplary only, and that significant variations between devices may exist that may employ embodiments of the present invention. FIG. 2A illustrates the base station 108, which may comprise a transmitter 202, receiver 204, radiocontroller 206, and antenna 208. The base station 108 may also comprise a processor 210, memory 212, and storage 214, communicating with one another and with the radiocontroller 206 over a bus 218. The base station 108 may comprise various elements directed toward determining the effects of resource allocations on the quality of service experienced by its served UEs, with one aspect of such quality of service being the channel gain experienced by UEs. The base station 108 may also comprise elements directed toward allocating resources to UEs based on quality of service considerations. Elements may, for example, comprise a gain determination module 220, an interference penalty determination module 222, a resource allocation module 224, and a network controller communication module 226. The gain determination module 220, the interference penalty determination module 222 resource allocation module 224, and the network controller communication module 226 may be implemented as software, residing in storage 214 and transferred to memory 212 as needed for execution by the processor 210.

FIG. 2B illustrates the network controller 114, which may suitably communicate with the base stations 108, 110, and 112 using mechanisms known in the art, and may employ a processor 228, memory 230, and storage 232, communicating over a bus 234. The network controller 114 may also employ a base station management module 236, a gain analysis module 238, for analyzing gain information reported by the base stations 108-112, an interference penalty determination module 240, and a resource allocation determination module 242.

FIG. 2C illustrates the UE 116, which may comprise a transmitter 242, receiver 244, radiocontroller 246, and antenna 248. The UE 116 may also comprise a processor 250, memory 252, and storage 254, communicating with one another and with the radiocontroller 256 over a bus 258. The UE 116 may further comprise a gain determination module 260, a gain reporting module 262, and an interference penalty determination module 264.

The network controller 114 may suitably receive gain information from the base stations 108-112 and compute interference penalty information and perform resource allocation for the network 100 as a whole, or each of the base stations 108-112 may receive or compute gain information for its users and compute interference penalty information and perform resource allocation for its users. A UE such as the UE 116 may receive or compute gain information relating to its own activities and compute the interference penalty imposed on other users by its activities, and may furnish this information to its serving base station.

The following computations may be carried out by any network device allocating resources or determining which resources should be allocated, or by any device that is performing computations for use by another device allocating resources or making resource allocation determinations. Embodiments of the present invention take approaches that involve determining the interference penalty imposed by scheduling and resource allocation decisions, with the value of g′ being taken into account in determining the interference penalty. An exemplary set of computations, carried out to determine uplink scheduling for an LTE cellular system, is presented below. The following computations may be carried out by any network device allocating resources or determining which resources should be allocated, or by any device that is performing computations for use by another device allocating resources or making resource allocation determinations. For convenience, the computations below may be thought of as being carried out over the network 100 as a whole by the network controller 114.

For a user i, which may be one of the UEs 116-132, a target received signal to noise ratio (SINR) nu_(i) may be computed as follows:

${nu}_{i} \approx {v_{i}^{\gamma}\frac{P_{0}}{I + N_{T}}\max \left\{ {\left( \frac{g_{i}}{g_{i}^{\prime}} \right)^{\alpha},S_{i}} \right\}}$

where γ and α are adjustment parameters, P₀ is a power parameter, and S_(i) is a lower bound on

$\frac{g_{i}}{g_{i}^{\prime}}.$

I is interference seen at the base station of the cell, and N_(T) is thermal noise seen at the base station of the cell. v_(i) is a function given by v_(i)=v_(i) (x_(i), d_(i), q_(i)), where, for the user (and bearer), x_(i)=throughput, d_(i),=delay, and q_(i)=queue length. A special case of this function can be seen in the case in which the throughput dependence is given by:

$v_{i} = \left\{ \begin{matrix} {x_{i}^{- \beta},{x_{i} < C}} \\ {{hC}^{- \beta},{x_{i} \geq C}} \end{matrix} \right.$

where C is a target throughput for the user and bearer, and may be determined by any one or more of a number of factors. One exemplary factor is a subscription class to which the user belongs, such as diamond, gold, and silver, with a user in a higher class being entitled to a higher throughput. The values β and h are fixed parameters, subject to the constraints that β≧0 and h≦1. If the value of C is set to infinity, the special case presented above yields the typical term for the proportional fair metric.

The target received SINR, that is, nu_(i), may be used in computing an appropriate metric that may be employed to rank users. According to one embodiment of the present invention, the transmit power is used as a criterion for ranking of users, and is calculated as follows:

$p_{i} = {\min \left\{ {P_{\max},{\frac{n_{i}\left( {I + N_{T}} \right)}{{bg}_{i}}{nu}_{i}}} \right\}}$

The various users i=1, 2, 3, . . . , n, may simply be ranked according to their transmit power p_(i) for each user i, calculated using the above expression, which takes into account the channel gains g′ to other users' receivers due to the use of the value nu_(i). The value b is a correction factor of the user's channel, which may be an SINR correction factor or a static system factor, and n_(i) is the number of resource blocks allocated to user i.

An approach used in another embodiment of the invention is to compute a specific user metric as follows:

$m_{i} = {v_{i}\left\lbrack {{\ln \left( {1 + {\min \left\{ {\sigma_{i},{nu}_{i}} \right\}}} \right)} - \frac{\min \left\{ {\sigma_{i},{nu}_{i}} \right\}}{{nu}_{i} + 1}} \right\rbrack}$

and to rank the users i=1, 2, 3, . . . , n according to the computed value of m_(i) for each user i, with the value of m_(i) also taking interference into account due to the use of the value nu_(i) in the expression above. In the above expression, the value σ is an upper bound on SINR beyond which an increase in SINR provides no additional benefit.

An approach according to another embodiment of the invention is to determine the allocation of channel resource blocks to users based not only on the advantages to the user under consideration for allocation of the resource blocks, but on the potential advantage to other users of being allocated the resource blocks for themselves. The number of channel resource blocks allocated to a user i is given by N_(i)* where N_(i)* is selected from (N_(REQ), N_(Q), N_(MCS), N_(TBS)), where REQ stands for “required,” Q stands for the drainout queue, MCS stands for “modulation and coding scheme” and TBS stands for “transport block size”.

If desired, resource blocks may first be allocated based on quality of service classes to which users belong, with users who are entitled to guaranteed bit rates being allocated sufficient resource blocks to fulfill the guarantee and with other users being allocated the remaining resource blocks according to criteria discussed below. Users may be entitled to guaranteed bit rates based, for example, on the activities in which they are engaged or on their subscription classes, for example. A user using voice over IP (VOIP) services may be entitled to a guaranteed bit rate based on the need for such a bit rate in order to receive acceptable service. Another user might belong to a premium subscription class and might be entitled to a guaranteed bit rate because of the subscription class.

In one approach, the objective for users that are not provided with guaranteed bit rates is to maximize the total bit rate for all such users, subject to a constraint that all users be provided the target throughput C, to the extent to which this is achievable. Users may be divided into categories based on efficiency. Category 1 may include low efficiency users, such as cell edge users, who are unable to achieve C regardless of the SINR they are provided. Category 3 users are users that are able to achieve C, but only with some boost to their weights v, and category 2 users are high efficiency users who can receive significant benefits from increased target SINR.

FIGS. 3A-3C illustrate graphs 302, 304, and 306, respectively, plotting weights v against throughput for category 1, category 2, and category 3 devices. The graph 302 of FIG. 3A illustrates proportional fair scheduling, the graph 304 of FIG. 3B illustrates an embodiment of the invention employing the metric m_(i) calculated as presented above, and the graph 306 of FIG. 3C illustrates an approach according to an embodiment of the present invention, wherein channel resource allocation is performed as described in greater detail below. In FIG. 3C, it can be seen that category 1 users cannot achieve the target throughput C. This condition is represented by the condition of infinite weight v to achieve the rate constraint. For category 3 users, the weights v can be shown to vary due to the making of adjustments to achieve the rate constraint, and for category 2 users it can be seen that a high rate is achieved with a low weights v requirement.

In order to achieve the desired objective, namely, the achievement (for non guaranteed bit rate users) total throughput over all users while meeting (for non category 1 users) the minimum rate constraint C, embodiments of the present invention perform specific allocation of channel resource blocks to users in a way that balances the benefits to the individual user against the overall benefits to users throughout the system. The resource block allocation to a user is given by the value N*, where N the number of resource blocks and N* is the target number of resource blocks. In the present exemplary embodiment, the target value N* is taken from one of N_(TBS) where TBS is the transport block size, N_(MCS) where MCS is the modulation and coding scheme, N_(REQ) where REQ is “required,” and N_(Q). In order to target a throughput of C, a value for TBS_(REQ) is computed as provided by Δ(t+1) below, where Δ(t+1) is the number of additional bits needed at time (t+1) in order to achieve C.

x(t + 1) = λ x(t) + (1 − λ)Δ(t + 1) ${x\left( {t + 1} \right)} = {\left. C\Rightarrow{\Delta \left( {t + 1} \right)} \right. = {\min \left\{ {\frac{C - {\lambda \; {x(t)}}}{\left( {1 - \lambda} \right)},0} \right\}}}$

For each TBS_(REQ), the required number of RBs, which may be referred to as N_(REQ), may be given by

${{TBS}_{REQ} = {N_{REQ}a\; {\log \left( {1 + {b\; \min \left\{ {\frac{{gP}_{\max}}{N_{REQ}\left( {I + N_{T}} \right)},{nu}} \right\}}} \right)}}},$

where α is a rate adjustment coefficient.

FIG. 4 presents a graph 400 illustrating the behavior of various parameters as N* increases. The graph 400 includes curves 402, 404, 406, and 408, illustrating parameters shown are transmit power, power per resource block, target SINR, and TBS_(REQ), respectively. In the present example, transmit power increases with increasing N until P_(MAX) is achieved when N reaches N_(MCS). Once P_(MAX) is reached, transmit power stops increasing. This behavior is illustrated by the curve 402. Power per resource block, illustrated by the curve 404, remains steady as power increases, because the power increases as the number of resource blocks increases. Once P_(MAX) is reached, power per resource block begins to decrease because the number of resource blocks increase without a corresponding increase in power. The required transport block size also increases as transmit power increases, and begins to approach a bound once N_(MCS) is reached, as illustrated by the curve 408. In the present example, the target SINR begins to decrease as the number of resource blocks exceeds N_(MCS). The curve 406 shows that the target SINR has some lower bound, and this is true because no matter how efficient communication becomes and how many resources are provided, some signal to noise ratio will still be needed.

The target resource block allocation N* is given by min{N_(Q), N_(REQ), N_(TBS)}.

Once the target resource block number N* has been calculated for each user, it may be summed over all users and the total, ΣN*, compared to the total resource blocks available. If the value of ΣN* is greater than the total resource blocks available, the value of N* should be decreased, and if the value of ΣN* is equal to the total resource blocks available, the value of N* is correct. If the value of ΣN* is less than the total resource blocks available, the value of N* may be increased and additional resource blocks may be allocated to the most efficient users. One exemplary procedure for determining this addition is as follows:

-   -   Rank order users in decreasing order of (g/g′)     -   Beginning with the highest-ranked user, add RBs (up to a maximum         of N_(MCS)) to each UE while RBs are available.     -   If RBs are still available, add RBs (up to a maximum of N_(TBS))         to each UE while RBs are available.

In order to determine allocation to specific UEs, the following procedure may be used. It will be recognized that resource blocks represent bandwidth resources in an LTE system. That is, a number of resource blocks represent a portion of the available bandwidth. Resource blocks need to be allocated to a UE contiguously. Suppose that the resource blocks are arranged contiguously in a horizontal row 500, as illustrated in FIG. 5, with the blocks ranging from block 502A to block 502W. A window 504 is placed over the row 500 to select contiguous blocks.

The window 504 is set at the size N* determined as discussed above. For the UE with the largest value of N*, set the size of the window 404 to the size N* and slide it over the row 500 to find the best location in the row based on a per resource block metric m_(i,j) discussed below. Selection of the UE may be in category order, for example, a UE in category 1 may be selected for the operation, then a UE in category 2, then a UE in category 3, then returning to category 1. In the present example, the resource blocks 502A-502W have been numbered from 1 to 23 for convenience, and the metric m_(i,j) is based on a per resource block calculation, taking into account the gain afforded to the UE i by allocation of the resource block j compared to the that would be provided to other users by the resource block. The gain provided to other users may be found, for example, by computing the gain for each user other than the user i and comparing the maximum gain among the users to that provided to the user i.

The window 504 is contracted or expanded left or right using the metric, with the following criteria being used to stop the expansion or contraction. For a category 1 UE, that is, a UE for which N* is N_(TBS), the resource block allocation that maximizes TBS is chosen. For a category 2 UE, that is, a UE for which N* is N_(MCS), the resource block allocation is chosen such that TBS is maximized subject to transmit power P being less than P_(MAX). For a category 3 UE, that is, a UE for which N* is N_(REQ), the allocation chosen is the smallest allocation such that TBS is equal to TBS_(REQ). Power control may suitably be performed based on nu, that is, the target SINR, and the corresponding MCS.

An evaluation is performed to determine whether to allocate the resource blocks to the UE. For each resource block j, an evaluation is performed, taking into account a comparison between the gain provided to the user i by the resource block j and the average gain provided to the user i over all resource blocks, coupled with a comparison of the gain provided to other users by the resource block j and the average gain provided to other users by all resource blocks. The evaluation is performed based on the following metric:

$\frac{m_{i,j} = \left( \frac{g_{i,j}}{g_{i}} \right)}{\max\limits_{o \neq i}\left( \frac{g_{o,j}}{g_{o}} \right)}$

It will be recognized that the value of m_(i,j) is higher when two conditions are fulfilled—first, that the gain provided by the resource block j is higher than the average over all resource blocks, and second, that the gain provided by the resource block j to other users is lower than the average, or at least not higher than the average, over all resource blocks. The numerator of the expression for increases with the relative improvement to the user i provided by the resource block j, but this increase may be matched or overcome by an improvement to another user. Thus, the value m_(i,j) will tend to favor providing an exceptionally favorable resource block to the user i, but this tendency may be lessened or overcome if the resource block is equally favorable, or more favorable, for another user.

In order to perform the various evaluations employed by embodiments of the present invention, it is advantageous to determine the relative channel gain

$\frac{g_{i}}{g_{i}^{\prime}}.$

One mechanism for determining this relative channel gain is through inverting Shannon's capacity formula:

$\frac{g_{i}}{g_{i}^{\prime}} = {{\frac{g_{k_{0}i}^{UL}}{\sum\limits_{k \neq k_{0}}^{\;}g_{ki}^{UL}} \approx S_{CQI}}:={\frac{P_{k_{0}}g_{k_{0}i}^{DL}}{{\sum\limits_{k \neq k_{0}}^{\;}{P_{k}g_{ki}^{DL}}} + N_{T}} = {\frac{1}{b_{CQI}}{\left( {2^{\frac{{MPR}{({CQI})}}{a_{CQI}}} - 1} \right).}}}}$

Various values used in this expression are defined as follows:

-   -   a_(CQI)—rate adjustment coefficient for CQI conversion;     -   b_(CQI)—SINR adjustment coefficient for CQI conversion;     -   g^(DL) _(ki)—channel gain from the eNB k to the user i;     -   P_(k)—transmit power of eNB k. Because this is measured on the         data channel for the neighbor cell, the transmit power can be         activity dependent. Thus, the transmit power may be filtered         over time and possibly over frequency.

A sounding reference signal based channel gain multiplier may also be added to the expression above. This might be a varying term g^(fast) _(i).

In the description above, a constant value for an interference penalty or price is used, captured by the constant λ=1/P₀ in the SINR target nu_(i). This constant can be replaced by a dynamic quantity, with the interference penalty or price being given by the following expression:

$\lambda_{i} = {{- {\sum\limits_{k}^{\;}\frac{V_{k}}{p_{i}}}} = {{- {\sum\limits_{k}^{\;}{\frac{\partial V_{k}}{\partial I_{k}}\frac{\partial I_{k}}{\partial p_{i}}}}} = {\sum\limits_{k}^{\;}{c_{k}g_{i,k}\text{=:}\mspace{14mu} {cg}_{i}^{\prime}}}}}$

where

-   V_(k) is the value function in neighbor cell k. I_(k) is the total     interference in neighbor cell k.

$c_{k} = {{- \frac{\partial V_{k}}{\partial I_{k}}} = {\left( {\sum\limits_{j \in {{cell}\mspace{14mu} k}}^{\;}{{av}_{j}n_{j}\frac{\frac{p_{j}g_{j}}{n_{j}}}{\frac{p_{j}g_{j}}{n_{j}} + I + N_{T}}}} \right){\frac{1}{I + N_{T}}.}}}$

FIG. 6 illustrates a process 600 of scheduling management and resource allocation according to an embodiment of the present invention. At step 602, channel gain information for receivers is obtained, with the channel information being evaluated with respect to the gain provided by each user receiver in comparison with that obtained by other user receivers. At step 604, determinations are made with respect to interference penalties imposed by receivers on one another. At step 606, user categories are determined based on one or more of service category entitlements and efficiency. At step 608, one or more metrics are computed for scheduling and resource allocation, with scheduling and allocation for each user being based on both gain for the user and overall gain. At step 610, resources are allocated and scheduling is performed based on or more metrics.

FIG. 7 illustrates a graph 700 showing the improvement provided by one embodiment of the present invention, ranking users according to the metric m_(i) whose calculation is shown above, as compared to prior art mechanisms for a 3GPP macro case 1 scenario. The graph 700 plots cell edge throughput against sector throughput, and the results achieved by prior art mechanisms are shown in the curve 702, plotting cell edge throughput against sector throughput, while the results achieved by an embodiment of the present invention are shown in the curve 704, showing a significant improvement in both cell edge and sector throughput.

FIG. 8 illustrates a graph 800 showing the improvement provided by one embodiment of the present invention, using the scheduling and allocation of resource blocks using the metric m_(i,j) whose calculation is shown above, as compared to prior art mechanisms for a 3GPP macro case 3 scenario. The graph 800 plots cell edge throughput against sector throughput, and the results achieved by prior art mechanisms are shown in the curve 802, plotting cell edge throughput against sector throughput, while the results achieved by an embodiment of the present invention are shown in the curve 804, showing a significant improvement in both cell edge and sector throughput.

Various modifications and adaptations to the foregoing exemplary embodiments of this invention may become apparent to those skilled in the relevant arts in view of the foregoing description. While various exemplary embodiments have been described above it should be appreciated that the practice of the invention is not limited to the exemplary embodiments shown and discussed here.

Further, some of the various features of the above non-limiting embodiments may be used to advantage without the corresponding use of other described features. The foregoing description should therefore be considered as merely illustrative of the principles, teachings and exemplary embodiments of this invention, and not in limitation thereof.

In addition, the various names used for the various parameters, such as g_(i), g′_(i), m_(i,j), C, nu_(i), v, and the like, are not intending to be limited in any respect, as these parameters may be identified by any suitable names. Further, the formulas and expressions that use these various parameters may differ from those expressly disclosed herein. 

1. A method comprising: receiving channel gain information from a user equipment, wherein the channel gain information comprises measurements of channel gain experienced by the user equipment to its serving and neighboring cell base stations; computing one or more parameters for scheduling and resource allocation among the user equipment and additional user equipments, wherein the one or more parameters are calculated so as to take into account the measurements of channel gain experienced by the user equipment to its serving and neighboring cell base stations.
 2. The method of claim 1, further comprising performing one or more of scheduling and resource allocation among the user equipment and the additional user equipments.
 3. The method of claim 1, wherein the channel gain information received from the user equipment is information relating to the monitoring by the user equipment of transmissions from the user equipment's serving base station and to the monitoring by the user equipment of transmissions from the base stations serving neighbor cells of the user equipment.
 4. The method of claim 1, wherein the channel gain information is received from the user equipment by the user equipment's serving base station.
 5. The method of claim 1, wherein at least one of the one or more parameters comprises transmit power.
 6. The method of claim 1, wherein at least one of the one or more parameters comprises a target signal to noise ratio.
 7. The method of claim 1, wherein at least one of the one or more parameters is calculated so as to maximize overall throughput among all of a plurality of user equipments while providing at least a guaranteed minimum throughput to all users capable of receiving the guaranteed minimum throughput.
 8. The method of claim 7, wherein the plurality of user equipments comprises user equipments not entitled to a guaranteed bit rate.
 9. The method of claim 1, wherein at least one of the one or more parameters takes into account benefits provided to user equipments by allocation of resource blocks to the user equipments.
 10. The method of claim 9, wherein the taking into account benefits provided to the user equipments is performed per resource block and takes into account the benefit provided to a user equipment by allocation of a resource block against average benefit provided to the user equipment.
 11. The method of claim 10, wherein the taking into account benefits provided to the user equipments evaluates the benefits provided by a resource block to one user equipment against the benefits provided by the resource block to a different user equipment.
 12. The method of claim 1, wherein at least one of the one or more parameters computes a target number of resource blocks.
 13. The method of claim 12, wherein the at least one of the one or more parameters computes a target number of resource blocks for each of a plurality of categories of user equipments, wherein the user equipments are assigned to categories by transmission efficiency.
 14. The method of claim 12, wherein resource blocks are allocated to user equipments in contiguous groups with the size of a contiguous group assigned to a user equipment being computed based at least in part on the target number of resource blocks computed for the user equipment.
 15. The method of claim 1, wherein at least one of the parameters comprises a user ranking metric computed for relative ranking of users.
 16. The method of claim 15, wherein the user ranking metric comprises information relating to target numbers of resource blocks and categories of user equipments, wherein user equipments are assigned to categories according to transmission efficiency.
 17. An apparatus comprising: a processor; memory storing a program of instructions, wherein the program of instructions are configured, with the processor and the memory, to cause the apparatus to perform at least the functions of: receiving channel gain information from a user equipment, wherein the channel gain information comprises measurements of channel gain experienced by the user equipment to its serving and neighboring cell base stations; computing one or more parameters for scheduling and resource allocation among the user equipment and the other user equipments, wherein the one or more parameters are calculated so as to take into account the measurements of channel gain experienced by the user equipment to its serving and neighboring cell base stations.
 18. The apparatus of claim 17, wherein the functions further comprise performing one or more of scheduling and resource allocation among the user equipment and the additional user equipments.
 19. The apparatus of claim 17, wherein at least one of the one or more parameters comprises transmit power.
 20. The apparatus of claim 17, wherein at least one of the one or more parameters is a metric taking into account a target signal to noise ratio. 